Towards Trace Metrics via Functor Lifting
نویسندگان
چکیده
We investigate the possibility of deriving metric trace semantics in a coalgebraic framework. First, we generalize a technique for systematically lifting functors from the category Set of sets to the category PMet of pseudometric spaces, by identifying conditions under which also natural transformations, monads and distributive laws can be lifted. By exploiting some recent work on an abstract determinization, these results enable the derivation of trace metrics starting from coalgebras in Set. More precisely, for a coalgebra in Set we determinize it, thus obtaining a coalgebra in the Eilenberg-Moore category of a monad. When the monad can be lifted to PMet, we can equip the final coalgebra with a behavioral distance. The trace distance between two states of the original coalgebra is the distance between their images in the determinized coalgebra through the unit of the monad. We show how our framework applies to nondeterministic automata and probabilistic automata. 1998 ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Programs, D.2.4 Software/Program Verification
منابع مشابه
Coalgebraic Behavioral Metrics
We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. Given a coalgebra $\alpha\colon X \to HX$ for a functor $H \colon \mathrm{Set}\to \mathrm{Set}$, we define a framework for deriving pseudometrics on $X$ which measure the behavioral distance of states. A crucial step is the lifting of the functor $H$ on $\mathrm{...
متن کاملBehavioral Metrics via Functor Lifting
We study behavioral metrics in an abstract coalgebraic setting. Given a coalgebra α : X → FX in Set, where the functor F specifies the branching type, we define a framework for deriving pseudometrics on X which measure the behavioral distance of states. A first crucial step is the lifting of the functor F on Set to a functor F in the category PMet of pseudometric spaces. We present two differen...
متن کاملTrace Semantics via Generic Observations
Recent progress on defining abstract trace semantics for coalgebras rests upon two observations: (i) coalgebraic bisimulation for deterministic automata coincides with trace equivalence, and (ii) the classical powerset construction for automata determinization instantiates the generic idea of lifting a functor to the Eilenberg-Moore category of an appropriate monad T. We take this approach one ...
متن کاملTrace Semantics for Coalgebras
Traditionally, traces are the sequences of labels associated with paths in transition systems X → P(A×X). Here we describe traces more generally, for coalgebras of the form X → P(F (X)), where F is a polynomial functor. The main result states that F ’s final coalgebra Z ∼= −→ F (Z) gives rise to a weakly final coalgebra with state space P(Z), in a suitable category of coalgebras. Weak finality ...
متن کاملPredicate and Relation Lifting for Parametric Algebraic Specifications
Relation lifting [6] extends an endofunctor F : C //C to a functor Rel(F ) : Rel(C) //Rel(C), where Rel(C) is a suitable category of relations over C. The relation lifting for the functor F can be used to define the notion of bisimulation for coalgebras X //F (X). The related notion of predicate lifting can be used to define invariants for F–coalgebras. Predicate and relation lifting can be dir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015